Composing Inference Algorithms as Program Transformations

نویسندگان

  • Robert Zinkov
  • Chung-chieh Shan
چکیده

Probabilistic inference procedures are usually coded painstakingly from scratch, for each target model and each inference algorithm. We reduce this effort by generating inference procedures from models automatically. We make this code generation modular by decomposing inference algorithms into reusable program-toprogram transformations. These transformations perform exact inference as well as generate probabilistic programs that compute expectations, densities, and MCMC samples. The resulting inference procedures are about as accurate and fast as other probabilistic programming systems on real-world problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic Inference by Program Transformation in Hakaru (System Description)

We present Hakaru, a new probabilistic programming system that allows composable reuse of distributions, queries, and inference algorithms, all expressed in a single language of measures. The system implements two automatic and semantics-preserving program transformations—disintegration, which calculates conditional distributions, and simplification, which subsumes exact inference by computer a...

متن کامل

Composing transformations for instrumentation and incrementalization of real applications

This paper describes powerful transformations for instrumenting and incrementalizing real applications, and composition of transformation rules for improving both the transformed programs and the application of transformation rules. The example transformations for instrumentation are for ranking peers in BitTorrent. The example transformations for incrementalization are for optimizing the instr...

متن کامل

Preliminary Proceedings of the Tenth Workshop on Language Descriptions Tools and Applications LDTA 2010

Standard inference algorithms for type systems involving ML-style polymorphism aim at reconstructing principal types for all let-bound identifiers. Using such algorithms to implement modular program optimisations by means of type-driven transformation techniques generally yields suboptimal results. We demonstrate how this defect can be made up for by using algorithms that target at obtaining so...

متن کامل

Duality: an Architecture Independent Design Model for Parallel Systems Based on Partial Order Semantics

This paper introduces DUALITY, a design model that provides a more structured style of parallel programming and reenes causal-ity from concurrency. We investigate semantic and syntactic transformations that support identifying the structure of a parallel program, as the basis for reducing the design complexity. The initial focus is on specii-cation and correctness, then gradually adding archite...

متن کامل

Normalizing Empirically Underidentified Linear State-Space Models

Normalizing latent-variable models in empirical work has sometimes more influence on statistical inference than commonly appreciated. In this paper, I show how relating non-identification to an invariance property of the likelihood function under certain groups of parameter transformations helps understanding the influence of normalization on inference and can guide the choice of identifying re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1603.01882  شماره 

صفحات  -

تاریخ انتشار 2017